#include <bits/stdc++.h>
using  namespace std;
int  n,m;
int A[100005];
int main(){
	freopen("duel.in","r",stdin);
	freopen("duel.out","w",stdout);
	cin  >> n;
	for(int i=1;i<=n;i++){
		cin >> A[i];
	}
	sort(A+1,A+n+1);
	int p=1;
	int s=1;
	int maxx=0;
	while(p<=n){
		if(A[p]!=A[p+1]){
			if(maxx<s){
				maxx=s;
			}
			s=1;
		}
		if(A[p]==A[p+1]){
			s++;
		}
		p++;
	}
	cout   <<  maxx;
	fclose(stdin);
	fclose(stdout);
	return 0;
}
